Recording apparatus, recording method, and program

ABSTRACT

Each packet is separated from a packet string, and information indicating an arrival timing of each packet is output. The packet is divided into divided packets having a size which does not cause a buffer overflow, and a packet arrival time of each divided packet is embedded in a header of the divided packet. The present technology is applied to the recording apparatus.

TECHNICAL FIELD

The present technology relates to a recording apparatus, a recordingmethod, and a program, and particularly, to a recording apparatus, arecording method, and a program capable of avoiding a buffer overflowwhen packet data is reproduced.

BACKGROUND ART

A moving picture experts group (MPEG)-2 transport stream (TS) prescribedin ISO 13818-1 is used as a packet data structure for satellite digitalbroadcasting, digital terrestrial broadcasting, and the like.

In a MPEG-2 TS packet data string, data including audio and video of atleast one or more programs is multiplexed in time division.

A packet of the MPEG-2 TS has a fixed length of 188 bytes.

In a case where the received packet data string is recorded, even whenthe recorded packet data string is read and reproduced, it is desirablethat the data can be reproduced by an apparatus similar to that forreceiving, decoding, viewing, and listening.

Therefore, a technology for applying a packet reception time to eachpacket and recording the time is used (refer to Patent Document 1).

With such a technology, when the recorded packet data string is read, bystarting to read the packet at the timing of the reception time, readingof the packet head can be started at a timing similar to the timing in acase where the packet is received, viewed, and listened.

CITATION LIST Patent Document

Patent Document 1: Japanese Patent No. 4973773 (Japanese PatentApplication Laid-Open No. 2011-028841)

SUMMARY OF THE INVENTION Problems to Be Solved By the Invention

Generally, data reading at the time of reproduction is performed at aspeed faster than a data input rate at the time of receiving, viewing,and listening to the data. Therefore, there has been a risk that abuffer overflow occurs when a buffer data size is same as that at thetime of receiving, viewing, and listening to the data.

Since the MPEG-2 TS packet has a relatively small fixed length of 188bytes, the overflow can be avoided by a small additional buffer of 188bytes.

However, in a case of a packet data structure having a relatively largeor variable packet size, the overflow cannot be avoided unless anadditional buffer for the maximum packet size is provided.

The present technology has been made in view of such a situation, and inparticular, the present technology can avoid a buffer overflow at thetime of reproduction.

Solutions to Problems

A recording apparatus according to one aspect of the present technologyincludes: a multiplexing/separating unit which separates each packetfrom a packet string; a packet dividing unit which divides the packetinto divided packets having a predetermined size; a packet arrival timegenerating unit which generates a packet arrival time of each dividedpacket; and a packet arrival time applying unit which embeds the packetarrival time generated by the time generating unit in a header of thedivided packet.

A recording unit which records the divided packet in which the packetarrival time is embedded in the header to a recording medium can befurther included. The predetermined size can correspond to a size of anadditional buffer which is added to be a data buffer size same as thatat the time of receiving, viewing, and listening by a reproducingapparatus, for reproducing the divided packet recorded to the recordingmedium, to avoid the buffer overflow.

When a reading maximum rate at the time when the reproducing apparatusreproduces the divided packet is Rp and a reading maximum rate at thetime when the divided packet is recorded is Rr, the predetermined sizecan be ((Rp/Rp−Rr)×(size of buffer)).

The multiplexing/separating unit can separate each packet from thepacket string and output information indicating an arrival timing ofeach packet, the packet arrival time generating unit can generate thepacket arrival time for each packet before the divided packet is dividedon the basis of the information indicating the arrival timing of eachpacket. Relative to a divided packet which is a head packet of thedivided packets, the packet arrival time of the packet before thedivided packet is divided can be embedded in the header as it is, andrelative to a second and subsequent divided packets of the dividedpackets, a packet arrival time corresponding time sequentiallycalculated from the packet arrival time of the packet before the dividedpacket is divided on the basis of the sizes of the divided packets andan input rate at the time of recording can be embedded in the header asthe packet arrival time.

The packet arrival time applying unit can set an extra header for eachdivided packet and embed an arrival time stamp (ATS) in the extra headeras the packet arrival time generated by the time generating unit.

In a case of MPEG Media Transport (MMT), the packet arrival timeapplying unit can embed the packet arrival time generated by the timegenerating unit in a header including a MMTP packet header of eachdivided packet in a network time protocol (NTP) format.

A simulating unit can be further included which simulates an operationof a reproducing apparatus which includes a buffer for sequentiallybuffering the divided packets recorded to the recording medium asnecessary and a decoding unit for sequentially decoding a divided packetstring buffered by the buffer and instructs the buffer dividing unit todivide the packet into the divided packets in a case where a bufferoverflow occurs in the simulation. The buffer dividing unit can dividethe packet into the divided packets only in a case where the simulatingunit instructs the buffer dividing unit to divide the packet into thedivided packets.

The simulating unit can instruct to divide the packet into the dividedpackets having the maximum packet length which does not cause the bufferoverflow from the simulation result in a case where the buffer overflowoccurs in the simulation, and the buffer dividing unit can divide thepacket into the divided packets having the maximum packet length whichdoes not cause the buffer overflow.

A recording method according to one aspect of the present technology isa recording method including: separating each packet from a packetstring; dividing the packet into divided packets having a predeterminedsize; generating a packet arrival time for each divided packet; andembedding the generated packet arrival time in a header of the dividedpacket.

A program according to one aspect of the present technology causes acomputer to function as: a multiplexing/separating unit which separateseach packet from a packet string; a packet dividing unit which dividesthe packet into divided packets having a predetermined size; a packetarrival time generating unit which generates a packet arrival time ofeach divided packet; and a packet arrival time applying unit whichembeds the packet arrival time generated by the time generating unit ina header of the divided packet.

In one aspect of the present technology, each packet is separated from apacket string, the packet is divided into divided packets having apredetermined size, a packet arrival time is generated for each dividedpacket, and the generated packet arrival time is embedded in a header ofthe divided packet.

The recording apparatus according to one aspect of the presenttechnology may be an independent apparatus and may be a blockfunctioning as the recording apparatus.

Effects of the Invention

According to one aspect of the present technology, it is possible toavoid a buffer overflow at the time of reproduction.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a diagram describing an exemplary configuration of aconventional recording apparatus.

FIG. 2 is a flowchart describing recording processing by the recordingapparatus in FIG. 1.

FIG. 3 is a time chart describing the recording processing by therecording apparatus in FIG. 1.

FIG. 4 is a diagram describing an exemplary configuration of a generalreproducing apparatus.

FIG. 5 is a flowchart describing reproducing processing by thereproducing apparatus in FIG. 4.

FIG. 6 is a time chart describing packet read timings in the recordingprocessing by the recording apparatus in FIG. 1 and in the reproducingprocessing by the reproducing apparatus in FIG. 4.

FIG. 7 is a diagram describing an exemplary configuration of a firstembodiment of a recording apparatus to which the present technology hasbeen applied.

FIG. 8 is a flowchart describing recording processing by the recordingapparatus in FIG. 7.

FIG. 9 is a time chart describing packet read timings in the recordingprocessing by the recording apparatus in FIG. 7 and in the reproducingprocessing by the reproducing apparatus in FIG. 4.

FIG. 10 is a diagram describing an exemplary configuration of a secondembodiment of a recording apparatus to which the present technology hasbeen applied.

FIG. 11 is a flowchart describing recording processing by the recordingapparatus in FIG. 10.

FIG. 12 is a diagram describing an exemplary configuration of ageneral-purpose personal computer.

MODE FOR CARRYING OUT THE INVENTION First Embodiment

<Exemplary Configuration of Conventional Recording Apparatus>

A configuration of a conventional recording apparatus is described firstwhen starting to describe a recording apparatus to which the presenttechnology has been applied.

A conventional recording apparatus 11 includes a multiplexing/separatingunit 31, a packet arrival time applying unit 32, a PLL unit 33, arecording unit 34, and a recording medium 35.

The multiplexing/separating unit 31 sequentially separates each packetfrom a packet string, as an input packet string, including movingpicture experts group (MPEG)-2 transport stream (TS) packets and thelike transmitted, for example, as digital broadcasting signals andsupplies the separated packets to the packet arrival time applying unit32. Furthermore, the multiplexing/separating unit 31 supplies clockreference information to restore clock signals of the transmission sideto the PLL unit 33.

In a case of the MPEG-2 TS packet, a program clock reference (PCR) isused as the clock reference information. Furthermore, in a case ofARIB-STD-B60 which is a standard using MPEG media transport (MMT)prescribed in Part 1 of the MPEG-H standard, the network time protocol(NTP) is used as the clock reference information.

The phase locked loop (PLL) unit 33 restores a transmission-side clockby using the clock reference information, generates a packet arrivaltime to be updated while being counted in synchronization with therestored clock, and supplies the generated packet arrival time to thepacket arrival time applying unit 32.

The packet arrival time applying unit 32 applies the packet arrival timeto a packet, which has been multiplexed and separated, to be recordedand supplies the packet to the recording unit 34.

The recording unit 34 records and stores the packet to which the packetarrival time has been applied to the recording medium 35.

<Recording Processing by Conventional Recording Apparatus>

Next, recording processing by the conventional recording apparatus 11 inFIG. 1 is described with reference to the flowchart in FIG. 2.

In step S11, the multiplexing/separating unit 31 supplies the packetstring including the MPEG-2 TS packets and the like transmitted, forexample, as digital broadcasting signals, as an input packet string tothe packet arrival time applying unit 32 by sequentially separating eachpacket from the packet string. Furthermore, the multiplexing/separatingunit 31 supplies the clock reference information to restore thetransmission-side clock signals to the PLL unit 33.

In step S12, the phase locked loop (PLL) unit 33 restores thetransmission-side clock by using the clock reference information,generates a packet arrival time to be updated while being counted insynchronization with the restored clock, and supplies the generatedpacket arrival time to the packet arrival time applying unit 32.

In step S13, the packet arrival time applying unit 32 applies the packetarrival time to the packet, which is multiplexed and separated, to berecorded by embedding the arrival time in a header and supplies thepacket to the recording unit 34.

In step S14, the recording unit 34 records and stores the packet, towhich the header having the packet arrival time embedded therein isapplied, to the recording medium 35.

In step S15, the multiplexing/separating unit 31 determines whether thenext packet is supplied. In a case where the next packet is supplied,the procedure returns to step S11, and subsequent processing isrepeated. Then, in a case where it has been determined in step S15 thatno packet is supplied, the procedure is terminated.

That is, according to the above processing, in a case of the MPEG-2 TSpacket, for example, when a packet 51-1 is supplied at a packet arrivaltime ATS [n] as illustrated in the upper part of FIG. 3, an extra header(Extra_Header) 52-1 including a packet arrival time ATS [n] 53-1 isapplied to the head of the packet 51-1 as illustrated in the lower partof FIG. 3.

Then, similarly to the above, in the following processing, for example,when a packet 51-2 is supplied at a packet arrival time ATS [n+1] asillustrated in the upper part of FIG. 3, an extra header (Extra_Header)52-2 including a packet arrival time ATS [n+1] 53-2 is applied to thehead of the packet 51-2 as illustrated in the lower part of FIG. 3.

In this way, the extra header 52 including the packet arrival time 53 issequentially applied to the head of each packet 51 in the packet string,and the extra header 52 is sequentially recorded to the recording medium35.

Note that, in FIG. 3, an example is illustrated in a case of an MPEG-2TS packet including a syntax which does not include packet arrival timeinformation in a packet header. That is, in a case of the MPEG-2 TSpacket, it is necessary to separately provide an additional header toembed the packet arrival time therein. Therefore, in a case of theMPEG-2 TS packet, an extra header (Extra_Header) is especially providedat the head of the packet, and the packet arrival time is embedded inthe extra header.

On the other hand, as a MPEG media transport (MMT) packet or the like,in a case where time information corresponding to the packet arrivaltime has been previously included as the syntax of each packet header(header having the name of MMTP packet header has been previouslyprovided), the packet arrival time may be embedded in the header whichhas been previously provided.

<Exemplary Configuration of Reproducing Apparatus>

Next, an exemplary configuration of a general reproducing apparatus isdescribed with reference to FIG. 4.

A reproducing apparatus 61 in FIG. 4 includes a recording medium 71, apacket reading unit 72, an ATC counter 73, a multiplexing/separatingunit 74, buffers 75-1 to 75-n, decoders 76-1 to 76-n, and a display 77.Note that, in the following description, the buffers 75-1 to 75-n andthe decoders 76-1 to 76-n are simply referred to as a buffer 75 and adecoder 76 unless it is necessary to distinguish them separately, andother components are similarly referred.

The recording medium 71 corresponds to the recording medium 35 in FIG. 1and stores the packets to which the header (extra header in a case ofMPEG-2 TS packet) where the packet arrival time is embedded is applied.The packets are sequentially read by the packet reading unit 72.

The packet reading unit 72 sequentially reads the packets to which theheaders recorded in the recording medium 71 have been applied andoutputs the packet to the multiplexing/separating unit 74 at the timingcorresponding to the packet arrival time embedded in the header on thebasis of the arrival time information supplied from the arrival timeclock (ATC) counter 73. That is, the packets are sequentially suppliedto the multiplexing/separating unit 74 on the basis of the informationof the ATC counter 73 and the information on the packet arrival time.Therefore, the packets are supplied to the multiplexing/separating unit74 so that the timing between the packets coincides with a time intervalbetween the packets in the packet string supplied at the time ofrecording.

The multiplexing/separating unit 74 separates information in packetunits which is supplied from the packet reading unit 72 in channelunits, and makes any one of the buffers 75-1 to 75-n buffer theseparated information.

The decoders 76-1 to 76-n read and decode the packet string buffered byeach of the buffers 75-1 to 75-n in channel units by a predetermineddata strength, and display the decoded result on the display 77, forexample, including a liquid crystal display (LCD) and the like.Furthermore, the data to be reproduced includes image data and audiodata. Here, to display the data on the display 77 means to display animage and output audio from a speaker (not shown) or the like.

<Reproducing Processing by Reproducing Apparatus in FIG. 4>

Next, reading buffering processing which is processing from reading thepacket by the reproducing apparatus in FIG. 4 to buffering is describedwith reference to the flowchart in FIG. 5.

In step S31, the ATC counter 73 sequentially starts to count a clockcounter corresponding to the time and sequentially outputs the countedvalue to the packet reading unit 72.

In step S32, the packet reading unit 72 sequentially reads a packetincluding a header from the recording medium 71.

In step S33, the packet reading unit 72 reads information on the packetarrival time embedded in the header of the read packet.

In step S34, the packet reading unit 72 determines whether it is thetiming corresponding to the packet arrival time on the basis of thevalue of the clock counter supplied from the ATC counter 73, and thepacket reading unit 72 repeats similar processing until the timing isassumed to correspond to the packet arrival time. Then, in a case whereit has been determined in step S34 that the value of the countersupplied from the ATC counter 73 is the timing corresponding to thepacket arrival time, the procedure proceeds to step S35.

In step S35, the packet reading unit 72 outputs the read packet to themultiplexing/separating unit 74.

In step S36, the multiplexing/separating unit 74 separates the suppliedpacket in channel units.

In step S37, the multiplexing/separating unit 74 makes the buffer 75 ofthe corresponding channel store (buffer) the separated packet.

In step S38, the packet reading unit 72 determines whether the nextpacket exists. In a case where the next packet exists, the procedurereturns to step S32, and subsequent processing is repeated.

Then, in a case where it has been determined in step S38 that no nextpacket exists, the procedure is terminated. At this time, the ATCcounter 73 stops counting.

Through the series of processing described above, the reproducingapparatus 61 sequentially reproduces the packet string recorded by therecording apparatus 11 by the predetermined data length.

Note that, it is not necessary to read the entire packet in step S32,and it is preferable that the arrival time be read. Therefore, in a casewhere only the arrival time is read in step S32, the packet reading unit72 reads the entire packet from the recording medium 71 and outputs theread packet to the multiplexing/separating unit 74 in step S35.

<Buffer Occupancy at the time of Reproduction>

Here, a transition of the buffer occupancy in the buffer 75 at the timeof the reproduction is described with reference to FIG. 6.

Generally, data reading at the time of reproduction is performed at aspeed faster than a data input rate at the time of receiving, viewing,and listening. Therefore, a buffer overflow may occur if the buffer sizeis same as that at the time of receiving, viewing, and listening.

That is, the reading rate at the time of reproduction is higher than theinput rate at the time of recording. Therefore, if the timing to readthe head of the packet 51-1 is adjusted to a time t11 corresponding tothe packet arrival time ATS [n], the packet 51-1 is read at the similarspeed to the time of recording as illustrated in the upper part of FIG.6. If it is assumed that the reading be completed at a time t13,normally, a time required to read the packet at the time of reproductionis shorter. For example, as indicated by a packet 91-1 illustrated inthe middle part of FIG. 6, the reading is completed at a time t12.Therefore, as illustrated in the lower part of FIG. 6, the bufferoccupancy in the buffer 75 is more rapidly increased as indicated by adotted line than that at the time of recording which is indicated by asolid line.

In addition, if the next packet 51-2 is read at a time t14 correspondingto the packet arrival time ATS [n+1] and reading is completed at a timet17 as illustrated in the upper part of FIG. 6, normally, a timerequired to read the packet at the time of reproduction is shorter. Forexample, as indicated by a packet 91-2 illustrated in the middle part ofFIG. 6, the reading is completed at a time t15. Therefore, asillustrated in the lower part of FIG. 6, the buffer occupancy in thebuffer 75 is more rapidly increased as indicated by the dotted line thanthat at the time of recording which is indicated by the solid line.

Here, in a case where it is assumed that the data be extracted from thebuffer 75 by the decoder 76 and be decoded at a time t16, the bufferoccupancy in the buffer 75 at the timing from the time t15 to the timet16 is extremely increased, and the buffer overflow may occur.

However, since the MPEG-2 TS packet has a relatively small fixed lengthof 188 bytes, it is possible to avoid the overflow by adding a smalladditional buffer of 188 bytes to the buffer 75 in FIG. 4. Here, theadditional buffer has a buffer size for avoiding the overflow which isadded to be the data buffer size same as that at the time of receiving,viewing, and listening by the reproducing apparatus 61 and is added tothe buffer 75.

However, in a case of a packet data structure having a relatively largeor a variable packet size, there is a risk that the overflow cannot beavoided unless the large additional buffer for the maximum packet sizeis provided.

In the reproducing apparatus, the buffer 75 is physically andindividually provided for each data type such as video and audio, and itis necessary to provide the large additional buffer having the maximumpacket size relative to each buffer 75 for each data type (capacity ofbuffer 75 needs to be larger). Therefore, the cost may increase.

<Exemplary Configuration of Recording Apparatus to Which PresentTechnology Has Been Applied>

Therefore, in the recording apparatus to which the present technologyhas been applied, the buffer overflow is avoided by dividing the size ofthe packet into a predetermined size of the packet and recording thepackets.

Note that, in FIG. 7, an exemplary configuration of a first embodimentof the recording apparatus to which the present technology has beenapplied is illustrated. Components of the recording apparatus 11 in FIG.7 having same functions as those in the recording apparatus 11 in FIG. 1are denoted with the same reference numerals and have the same names,and the description regarding them is appropriately omitted.

That is, the recording apparatus 11 in FIG. 7 is different from that inFIG. 1 in that a packet arrival time applying unit 102 is providedinstead of the packet arrival time applying unit 32, and in addition, apacket dividing unit 101 is newly provided.

The packet dividing unit 101 divides the separated packet supplied fromthe multiplexing/separating unit 31 into predetermined sizes capable ofavoiding the buffer overflow. Then, the packet dividing unit 101supplies the packet to the packet arrival time applying unit 32 as thedivided packet.

Here, the predetermined size capable of avoiding the buffer overflow canbe regarded as the maximum packet length necessary for avoiding thebuffer overflow. Therefore, for example, the predetermined size may bethe size of the additional buffer of the buffer 75 included in thereproducing apparatus 61.

Furthermore, the predetermined size of the packet to be divided, whichcorresponds to the size of the additional buffer of the buffer 75included in the reproducing apparatus 61, capable of avoiding the bufferoverflow may be a value calculated by the following formula (1) by usinga rate corresponding to an inclination of a graph indicating the changein the buffer occupancy in FIG. 6.

The predetermined size of the packet to be divided(packet maximum length)=(Rp/(Rp−Rr))×(size of buffer 75)   (1)

Here, Rp represents a reading maximum rate at the time of reproduction(inclination of dotted line portion in lower part of FIG. 6) asindicated by the dotted line in the lower part of FIG. 6, and Rrrepresents an input rate at the time of recording (inclination of solidline portion in lower part of FIG. 6) as indicated by the solid line inthe lower part of FIG. 6.

With this setting, it is possible to prevent occurrence of the bufferoverflow by dividing the packet into the packets having an appropriatesize.

In addition, the packet arrival time applying unit 102 applies a headerin which the packet arrival time is embedded or a header in which thepacket arrival time corresponding time corresponding to the packetarrival time is embedded as the packet arrival time to the dividedpacket.

<Recording Processing by Recording Apparatus in FIG. 7>

Next, recording processing by the recording apparatus in FIG. 7 isdescribed with reference to the flowchart in FIG. 8. Note that, sincethe processing in steps S51, S55, and S56 in the flowchart in FIG. 8 issimilar to the processing in steps S11, S14, and S15 in the flowchart inFIG. 2, the description thereof is omitted.

That is, in step S51, if the packet string is separated by themultiplexing/separating unit 31 in packet units, the packet dividingunit 101 divides the packet into predetermined lengths in size in stepS52, and supplies the divided packet to the packet arrival time applyingunit 102.

In step S53, the PLL unit 33 generates the packet arrival time on thebasis of the clock reference information and supplies the packet arrivaltime to the packet arrival time applying unit 102.

In step S54, the packet arrival time applying unit 102 embeds andapplies the packet arrival time supplied from the PLL unit 33 in theheader relative to the divided packet which is at the head of thedivided packets with respect to the packet, which is not divided yet,and outputs the packet to the recording unit 34. In addition, the packetarrival time applying unit 102 calculates the packet arrival timecorresponding time corresponding to the packet arrival time and embedsthe calculated time in the header of the packet as the packet arrivaltime relative to the second and subsequent divided packets of thepacket, which is not divided yet, of the divided packets and outputs thepackets to the recording unit 34.

More specifically, in a case of the MPEG-2 TS packet, since the headerin which the packet arrival time is embedded does not exist in theoriginal syntax, the packet arrival time applying unit 102 sets thepacket arrival time as an arrival time stamp (ATS) with an arrival timeclock (ATC) as the reference of the packet arrival time and applies theextra header in which the information on the packet arrival timeincluding the ATS is embedded to a head of a payload of each packet, andoutputs the packet to the recording unit 34.

Therefore, regarding the packets divided to avoid the buffer overflow,relative to the head packet, a time of actual arrival before thedivision is applied as the packet arrival time, and the extra header inwhich the packet arrival time corresponding time corresponding to thepacket arrival time calculated according to the packet length isembedded is applied to the subsequent divided packets.

On the other hand, in a case of the MPEG media transport (MMT) packet,since the reference of the packet arrival time is a universal time clock(UTC), the packet arrival time is received in a state where the packetarrival time is previously included in the header (MMTP packet header)52 in a network time protocol (NTP) format as illustrated in theuppermost row of FIG. 9.

In such a case, when a packet which exceeds the packet maximum lengthnecessary to avoid the buffer overflow relative to the size of thebuffer 75 of the reproducing apparatus 61 is input, the packet dividingunit 101 divides the input packet. A case is illustrated in the secondrow from the top in FIG. 9 where the packet 51 is divided into threepackets, i.e., packets 51 a to 51 c. Note that, a header 52 a which isthe same as the header 52 in which the packet arrival time is embeddedis applied to the divided packet 51 a. In addition, a header 53 a inwhich a packet arrival time corresponding time calculated from thepacket arrival time of the header 52 is embedded as the packet arrivaltime is applied to the divided packet 51 b, and similarly, a header 53 bin which a packet arrival time corresponding time calculated from thepacket arrival time of the header 52 is embedded as the packet arrivaltime is applied to the packet 51 c.

In a case where the packet 51 is divided into three, the packet arrivaltime applying unit 102 applies the header (MMTP packet header) 52 to thehead packet 51 a as the header 52 a in which the original packet arrivaltime is embedded. Furthermore, the packet arrival time applying unit 102applies the headers (MMTP packet header) 53 a and 53 b including thepacket arrival time corresponding time NTP [n]′ corresponding to thepacket arrival time to the second and subsequent packets 51 b and 51 cand generates the divided packets (MMTP packet).

At this time, the packet arrival time applying unit 102 may receive thepacket arrival times of the divided packets other than the head packetas the packet arrival time corresponding time of the head byte of thedivided packet from the PLL unit 33 and embed the received time in theheader and may calculate the packet arrival time corresponding timeaccording to the packet length of the divided packet and embed thecalculated time in the header.

In a case where the packet arrival time corresponding time is calculatedaccording to the packet length of the divided packet, the packet arrivaltime applying unit 102 may calculate the time, for example, by using thefollowing formula (2) on the basis of the input rate at the time ofrecording.NTP [n]′=NTP [n]+(size of packet [n])/(input rate at the time ofrecording)   (2)

Here, NTP [n]′ is a packet arrival time corresponding time of the packet[n]′, and NTP [n] is a packet arrival time or a packet arrival timecorresponding time of the packet [n] immediately before the packet [n]′.

Furthermore, in a case where the header is added by the division asillustrated in FIG. 9, and in a case where the header is input to thebuffer at the time of reproduction, the packet dividing unit 101calculates the packet maximum length by subtracting the total size ofthe header which may be stored in the buffer 75 from the size of thebuffer 75.

In a case where the packet 51 is not divided, a payload 91 and a header92, illustrated in the third row in FIG. 9, corresponding to the packet51 are read. When the packet is buffered from a time t31, the bufferoccupancy increases at a time t33 as indicated by a dotted line in afifth row in FIG. 9. That is, if the buffer occupancy rapidly increasesin this way, the buffer overflow may occur with high possibility.

However, as illustrated in the second row in FIG. 9, the packet 51 isdivided into the three packets, i.e., the packets 51 a to 51 c so thatprocessing is performed in three divided periods as indicated by theheaders 52 a, 53 a, and 53 b in the fourth row in FIG. 9.

As a result, regarding the processing on the head packet including apayload 91 a and a header 92 a corresponding to the packet 51 a, asindicated by a dashed-dotted line in the fifth row in FIG. 9, when thebuffering is started at the time t31, the buffer occupancy before thebuffer overflow is maintained at and after a time t32, and the bufferoccupancy is decreased when the decoding is started at a time t34.

After that, when the buffering of the second packet including a payload91 b and a header 93 a corresponding to the packet 51 b is started at atime t35 and ends at a time t36 as indicated in the fourth row in FIG.9, as indicated by the dashed-dotted line in the fifth row in FIG. 9,the buffer occupancy is maintained from the time t36 to a time t37 in astate where the buffer overflow does not occur.

In addition, when the buffering of the third packet including a payload91 c and a header 93 b corresponding to the packet 51 c is started at atime t37 and ends at a time t38 as indicated in the fourth row in FIG.9, as indicated by the dashed-dotted line in the fifth row in FIG. 9,the buffer occupancy is maintained from the time t38 to a time t39 in astate where the buffer overflow does not occur.

That is, by dividing the packet length in this way and delaying thetransmission of the packets in stages, as indicated by the solid line inthe fifth row in FIG. 9, a state close to a change in the bufferoccupancy at the time of recording can be reproduced, and as a result,the buffer overflow can be avoided.

Second Embodiment

In the above, an example in which the packet is divided with the fixedpacket maximum length has been described. However, only in a case whereoperations of the buffer 75 and the decoder 76 are simulated for eachpacket and a buffer overflow occurs, the packet may be divided.

In FIG. 10, an exemplary configuration of a recording apparatus 11 inwhich packets are divided only in a case where the buffer overflowoccurs is illustrated. Note that, components having the same functionsas those in the recording apparatus 11 in FIG. 7 are denoted with thesame reference numerals and have the same names, and the descriptionregarding them is appropriately omitted.

That is, the recording apparatus 11 in FIG. 10 is different from therecording apparatus 11 in FIG. 7 in that a reading buffer simulatingunit 121 is newly provided, and in addition, a packet dividing unit 122is provided instead of the packet dividing unit 101.

The reading buffer simulating unit 121 reproduces decoding processing inthe buffer 75 and the decoder 76 by simulating the processing when aseparated packet string is sequentially processed, and determineswhether the buffer overflow occurs. Then, in a case where the bufferoverflow occurs, the reading buffer simulating unit 121 calculates themaximum packet length which does not cause the buffer overflow andinstructs the packet dividing unit 122 to divide the packet with themaximum packet length.

When the reading buffer simulating unit 121 does not instruct the packetdividing unit 122 to divide the packet, the packet dividing unit 122outputs the separated packet, which has been supplied, to the packetarrival time applying unit 102 as it is. In a case where the readingbuffer simulating unit 121 instructs the packet dividing unit 122 todivide the packet, the packet dividing unit 122 divides the separatedpacket with the maximum packet length supplied together with theinstruction and outputs the divided packets to the packet arrival timeapplying unit 102.

<Recording Processing by Recording Apparatus in FIG. 10>

Next, recording processing by the recording apparatus in FIG. 10 isdescribed with reference to the flowchart in FIG. 11.

Note that, since processing in steps S71, S76 to S79 in FIG. 11 issimilar to the processing in steps S51, S53 to S56 in FIG. 8, thedescription thereof is omitted.

That is, in step S72, the reading buffer simulating unit 121sequentially performs processing of the decoder 76 by the packet stringin packet units and simulates the buffer occupancy in the buffer 75 atthat time.

In step S73, the reading buffer simulating unit 121 determines whetherthe buffer overflow occurs. In a case where the buffer overflow occurs,the procedure proceeds to step S74.

In step S74, the reading buffer simulating unit 121 reads the maximumpacket length, corresponding to the maximum value of the bufferoccupancy when the buffer overflow does not occur, from the simulationresult and supplies the read maximum packet length to the packetdividing unit 122, and instructs the division of the packet.

In step S75, the packet dividing unit 122 divides the packet with themaximum packet length on the basis of the instruction from the readingbuffer simulating unit 121 and supplies the divided packets to thepacket arrival time applying unit 102.

On the other hand, in a case where the buffer overflow does not occur instep S73, the processing in steps S74 and S75 is skipped.

That is, when the packet string is sequentially decoded, the bufferoccupancy at the time when the buffer 75 is actually used is simulated,and the packet which is anticipated to cause the buffer overflow isdivided. In a case where the occurrence of the buffer overflow is notanticipated, the packet is not divided.

As a result, depending on whether the buffer overflow is anticipated, itis dynamically determined whether to divide the packet, and the packetis divided only when the buffer overflow occurs. Therefore, a load onunnecessary dividing processing can be reduced, and the buffer overflowcan be surely avoided.

Furthermore, in a case where it is anticipated that buffer overflowoccurs, the packet is divided with the maximum packet lengthcorresponding to the maximum buffer occupancy at the time when thebuffer overflow does not occur. Therefore, the dividing processing canbe minimized, and the buffer overflow can be surely and efficientlyavoided while reducing a processing load regarding the division.

Furthermore, in the above, an example of the recording apparatus and thereproducing apparatus has been described. However, for example, aconfiguration including a transmitting apparatus and a receivingapparatus may be used in which the transmitting apparatus performsprocessing of the recording apparatus and the receiving apparatusperforms processing of the reproducing apparatus when a broadcast signalis transmitted.

<Example in Which Software Performs Processing>

The above-mentioned series of processing can be performed by hardwareand software. In a case where the software performs the series ofprocessing, a program included in the software is installed from arecording medium to a computer incorporated in a dedicated hardware or,for example, a general-purpose personal computer which can performvarious functions by installing various programs.

FIG. 12 is an exemplary configuration of a general-purpose personalcomputer. The personal computer has a central processing unit (CPU) 1001built therein. The CPU 1001 is connected to an input/output interface1005 via a bus 1004. The bus 1004 is connected to a read only memory(ROM) 1002 and a random access memory (RAM) 1003.

The input/output interface 1005 is connected to an input unit 1006including an input device such as a keyboard and a mouse by which a userinputs an operation command, an output unit 1007 for outputting imagesof a processing operation screen and a processing result to a displaydevice, a storage unit 1008 including a hard disk drive or the likewhich stores a program and various data, and a communication unit 1009including a local area network (LAN) adapter and the like and forperforming communication processing through a network represented by theinternet. Furthermore, the input/output interface 1005 is connected to adrive 1010 for reading/writing the data relative to a removable medium1011 such as a magnetic disk (including a flexible disk), an opticaldisk (including a compact disc-read only memory (CD-ROM) and a digitalversatile disc (DVD)), an optical magnetic disk (including a mini disc(MD)), or a semiconductor memory.

The CPU 1001 performs various processing according to programs. Theprogram includes a program stored in the ROM 1002 or a program read fromthe removable medium 1011 such as the magnetic disk, the optical disk,the optical magnetic disk, or the semiconductor memory, installed to thestorage unit 1008, and loaded from the storage unit 1008 to the RAM1003. The RAM 1003 also appropriately stores data or the like necessaryfor the CPU 1001 to perform various processing.

In the computer configured as above, the CPU 1001 loads, for example,the program stored in the storage unit 1008 to the RAM 1003 via theinput/output interface 1005 and the bus 1004 and executes the program sothat the above-mentioned series of processing is performed.

The program performed by the computer (CPU 1001) can be recorded in theremovable medium 1011, for example, as a package media and provided.Furthermore, the program can be provided via a wired or wirelesstransmission media such as a local area network, the internet, anddigital satellite broadcasting.

In the computer, the program can be installed to the storage unit 1008via the input/output interface 1005 by mounting the removable medium1011 in the drive 1010. Furthermore, the program can be received by thecommunication unit 1009 via the wired or wireless transmission media andinstalled to the storage unit 1008. In addition, the program can bepreviously installed to the ROM 1002 and the storage unit 1008.

Note that, the program performed by the computer may be a program inwhich processing is performed along the order described herein in a timeseries manner and a program in which the processing is performed inparallel or at a necessary timing, for example, when a call has beenperformed.

Furthermore, a system means herein an assembly of a plurality ofcomponents (devices, modules (parts), and the like), and it is notconsidered whether all the components are in the same housing.Therefore, both of a plurality of devices respectively housed indifferent housings from each other and connected via the network and asingle device having a plurality of modules housed in one housing aresystems.

Furthermore, the embodiment of the present technology is not limited tothe above-mentioned embodiments, and various changes can be made withoutdeparting from the scope of the present technology.

For example, the present technology may have a configuration of cloudcomputing in which a single function is separately performed by aplurality of devices via a network in cooperation.

Furthermore, each step described with reference to the above-mentionedflowchart can be performed by the single device and can be divided andperformed by the plurality of devices.

In addition, in a case where a plurality of processing is included inone step, the plurality of processing included in one step can beperformed by the single device and can be divided and performed by theplurality of devices.

Note that, the present technology may have a configuration below.

<1> A recording apparatus including:

a multiplexing/separating unit configured to separate each packet from apacket string;

a packet dividing unit configured to divide the packet into dividedpackets having a predetermined size;

a packet arrival time generating unit configured to generate a packetarrival time of each divided packet; and

a packet arrival time applying unit configured to embed the packetarrival time generated by the time generating unit in a header of thedivided packet.

<2> The recording apparatus according to <1>, further including:

a recording unit configured to record the divided packet in which thepacket arrival time is embedded in the header to a recording medium, inwhich

the predetermined size corresponds to a size of an additional bufferwhich is added to be a data buffer size same as that at the time ofreceiving, viewing, and listening by a reproducing apparatus, forreproducing the divided packet recorded to the recording medium, toavoid a buffer overflow.

<3> The recording apparatus according to <2>, in which

when a reading maximum rate at the time when the reproducing apparatusreproduces the divided packet is Rp and a reading maximum rate at thetime when the divided packet is recorded is Rr, the predetermined sizeis ((Rp/Rp−Rr)×(size of the buffer)).

<4> The recording apparatus according to any one of <1> to <3>, in which

the multiplexing/separating unit separates each packet from the packetstring and outputs information indicating an arrival timing of eachpacket,

the packet arrival time generating unit generates the packet arrivaltime for each packet before the divided packet is divided on the basisof the information indicating the arrival timing of each packet,

relative to a divided packet which is a head packet of the dividedpackets, the packet arrival time of the packet before the divided packetis divided is embedded in the header as it is, and

relative to a second and subsequent divided packets from the head of thedivided packets, a packet arrival time corresponding time sequentiallycalculated on the basis of the size of the divided packet and an inputrate at the time of recording from the packet arrival time of the packetbefore the divided packet is divided is embedded in the header as thepacket arrival time.

<5> The recording apparatus according to any one of <1> to <4>, in which

the packet arrival time applying unit sets an extra header for eachdivided packet and embeds an arrival time stamp (ATS) in the extraheader as the packet arrival time generated by the time generating unit.

<6> The recording apparatus according to any one of <1> to <5>, in which

in a case of MPEG Media Transport (MMT), the packet arrival timeapplying unit embeds the packet arrival time generated by the timegenerating unit in a header including a MMTP packet header of eachdivided packet in a network time protocol (NTP) format.

<7> The recording apparatus according to any one of <1> to <6>, furtherincluding:

a simulating unit configured to simulate an operation of a reproducingapparatus which includes a buffer for sequentially buffering the dividedpackets recorded to the recording medium as necessary and a decodingunit for sequentially decoding a divided packet string buffered by thebuffer and to instruct the buffer dividing unit to divide the packetinto the divided packets in a case where a buffer overflow occurs in thesimulation, in which

the buffer dividing unit divides the packet into the divided packetsonly in a case where the simulating unit instructs to divide the packetinto the divided packets.

<8> The recording apparatus according to <7>, in which

the simulating unit instructs to divide the packet into the dividedpackets having the maximum packet length which does not cause the bufferoverflow from the simulation result in a case where the buffer overflowoccurs in the simulation, and

the buffer dividing unit divides the packet into the divided packetshaving the maximum packet length which does not cause the bufferoverflow.

<9> A recording method including:

separating each packet from a packet string;

dividing the packet into divided packets having a predetermined size;

generating a packet arrival time of each divided packet; and

embedding the generated packet arrival time in a header of the dividedpacket.

<10> A program for causing a computer to function as:

a multiplexing/separating unit configured to separate each packet from apacket string;

a packet dividing unit configured to divide the packet into dividedpackets having a predetermined size;

a packet arrival time generating unit configured to generate a packetarrival time of each divided packet; and

a packet arrival time applying unit configured to embed the packetarrival time generated by the time generating unit in a header of thedivided packet.

REFERENCE SIGNS LIST

-   11 recording apparatus-   31 multiplexing/separating unit-   32 packet arrival time applying unit-   33 PLL unit-   34 recording unit-   35 recording medium-   61 reproducing apparatus-   71 recording medium-   72 packet reading unit-   73 ATC counter-   74 multiplexing/separating unit-   75, 75-1 to 75-n buffer-   76, 76-1 to 76-n decoder-   77 display-   101 packet dividing unit-   102 packet arrival time applying unit-   121 reading buffer simulating unit-   122 packet dividing unit

The invention claimed is:
 1. A recording apparatus comprising: anelectronic processor; and a memory including a multiplexing/separatingprogram, a packet dividing program, a packet arrival time generatingprogram, and a packet arrival time applying program, themultiplexing/separating program, the packet dividing program, the packetarrival time generating program, and the packet arrival time applyingprogram being executable by the electronic processor to perform a set ofoperations comprising separating each packet from a packet string,dividing a packet that is separated from the packet string into dividedpackets, each divided packet of the divided packets having apredetermined size, generating a packet arrival time associated with theeach divided packet, and embedding the packet arrival times that aregenerated in corresponding headers of the divided packets, wherein thememory further includes a recording program, wherein the electronicprocessor is further configured to execute the recording program,wherein the set of operations further includes recording the dividedpackets in which the packet arrival times are embedded in thecorresponding headers to a recording medium, wherein the predeterminedsize corresponds to a size of an additional buffer which is added to bea data buffer size same as that at the time of receiving, viewing, andlistening by a reproducing apparatus, for reproducing the dividedpackets that are recorded to the recording medium, to avoid a bufferoverflow, wherein the predetermined size is (Rp/(Rp-Rr) x (size of thebuffer)), wherein a reading maximum rate at the time when thereproducing apparatus reproduces the each divided packet is the Rp, andwherein a reading maximum rate at the time when the each divided packetis recorded is the Rr.
 2. The recording apparatus according to claim 1,wherein the set of operations further includes separating the eachpacket from the packet string and outputting information indicating anarrival time of the each packet, and generating the packet arrival timeof the packet before the packet is divided into the divided packets on abasis of the information indicating the arrival time of the packet,wherein, relative to a head packet of the divided packets, the packetarrival time of the packet is embedded in a header of the head packet asthe packet arrival time, and wherein, relative to a second andsubsequent divided packets from the head packet of the divided packets,a packet arrival time corresponding time sequentially and calculated ona basis of the predetermined size of the each divided packet and aninput rate at the time of recording from the packet arrival time of thepacket is embedded in corresponding headers of the second and thesubsequent divided packets as the packet arrival time.
 3. The recordingapparatus according to claim 1, wherein the set of operations furtherincludes setting an extra header for the each divided packet, andembedding an arrival time stamp (ATS) in the extra header as the packetarrival time.
 4. The recording apparatus according to claim 1, whereinin a case of MPEG Media Transport (MMT), the corresponding headers areMMTP packet headers, and wherein the packet arrival times are in anetwork time protocol (NTP) format.
 5. The recording apparatus accordingto claim 1, wherein the memory further includes a simulating program,wherein the electronic processor is further configured to execute thesimulating program, and wherein the set of operations further includessimulating an operation of a reproducing apparatus which includes abuffer for sequentially buffering the divided packets recorded to arecording medium as necessary and a decoder for sequentially decoding adivided packet string buffered by the buffer, and dividing the packetinto the divided packets in a case where a buffer overflow occurs in thesimulation.
 6. The recording apparatus according to claim 5, wherein theset of operations further includes determining a maximum packet lengthof the each divided packet that does not cause the buffer overflow froma simulation result in the case where the buffer overflow occurs in thesimulation, and dividing the packet into the divided packets having themaximum packet length.
 7. A recording method comprising: separating,with an electronic processor, each packet from a packet string;dividing, with the electronic processor, a packet that is separated fromthe packet string into divided packets, each divided packet of thedivided packets having a predetermined size; generating, with theelectronic processor, a packet arrival time associated with the eachdivided packet; embedding, with the electronic processor, the packetarrival times that are generated in corresponding headers of the dividedpackets; and controlling, with the electronic processor, a recordingmedium to record the divided packets in which the packet arrival timesare embedded in the corresponding headers, wherein the predeterminedsize corresponds to a size of an additional buffer which is added to bea data buffer size same as that at the time of receiving, viewing, andlistening by a reproducing apparatus, for reproducing the dividedpackets that are recorded to the recording medium, to avoid a bufferoverflow, wherein the predetermined size is (Rp/(Rp-Rr) x (size of thebuffer)), wherein a reading maximum rate at the time when thereproducing apparatus reproduces the each divided packet is the Rp, andwherein a reading maximum rate at the time when the each divided packetis recorded is the Rr.
 8. The recording method according to claim 7,further comprising: separating, with the electronic processor, the eachpacket from the packet string and outputting information indicating anarrival time of the each packet; and generating, with the electronicprocessor, the packet arrival time of the packet before the packet isdivided into the divided packets on the basis of the informationindicating the arrival time of the packet, relative to a head packet ofthe divided packets, the packet arrival time of the packet is embeddedin a header of the head packet as the packet arrival time, and relativeto a second and subsequent divided packets from the head packet of thedivided packets, a packet arrival time corresponding time sequentiallyand calculated on a basis of the predetermined size of the each dividedpacket and an input rate at the time of recording from the packetarrival time of the packet is embedded in corresponding headers of thesecond and the subsequent divided packets as the packet arrival time. 9.The recording method according to claim 7, further comprising setting,with the electronic processor, an extra header for the each dividedpacket; and embedding, with the electronic processor, an arrival timestamp (ATS) in the extra header as the packet arrival time.
 10. Therecording method according to claim 7, wherein, in a case of MPEG MediaTransport (MMT), the corresponding headers are MMTP packet headers, andthe packet arrival times are in a network time protocol (NTP) format.11. A non-transitory computer-readable medium comprising a program that,when executed by an electronic processor, causes the electronicprocessor to perform a set of operations, the set of operationscomprising: separating each packet from a packet string; dividing apacket that is separated from the packet string into divided packets,each divided packet of the divided packets having a predetermined size;generating a packet arrival time associated with the each dividedpacket; and embedding the packet arrival times that are generated incorresponding headers of the divided packets, wherein the set ofoperations further includes controlling a recording medium to record thedivided packets in which the packet arrival times are embedded in thecorresponding headers, wherein the predetermined size corresponds to asize of an additional buffer which is added to be a data buffer sizesame as that at the time of receiving, viewing, and listening by areproducing apparatus, for reproducing the divided packets that arerecorded to the recording medium, to avoid a buffer overflow, whereinthe predetermined size is (Rp/(Rp-Rr) x (size of the buffer)), wherein areading maximum rate at the time when the reproducing apparatusreproduces the each divided packet is the Rp, and wherein a readingmaximum rate at the time when the each divided packet is recorded is theRr.
 12. The non-transitory computer-readable medium according to claim11, wherein the set of operations further includes separating the eachpacket from the packet string and outputting information indicating anarrival time of the each packet; and generating the packet arrival timeof the packet before the packet is divided into the divided packets on abasis of the information indicating the arrival time of the packet,wherein, relative to a head packet of the divided packets, the packetarrival time of the packet is embedded in a header of the head packet asthe packet arrival time, and wherein, relative to a second andsubsequent divided packets from the head packet of the divided packets,a packet arrival time corresponding time sequentially and calculated ona basis of the predetermined size of the each divided packet and aninput rate at the time of recording from the packet arrival time of thepacket is embedded in corresponding headers of the second and thesubsequent divided packets as the packet arrival time.
 13. Thenon-transitory computer-readable medium according to claim 11, whereinthe set of operations further includes setting an extra header for theeach divided packet; and embedding an arrival time stamp (ATS) in theextra header as the packet arrival time.
 14. The non-transitorycomputer-readable medium according to claim 11, wherein in a case ofMPEG Media Transport (MMT),the corresponding headers are MMTP packetheaders, and the packet arrive times are in a network time protocol(NTP) format.